Compressed sampling inequalities by Tchakaloff’s theorem
نویسنده
چکیده
We show that a discrete version of Tchakaloff’s theorem on the existence of positive algebraic cubature formulas, entails that the information required for multivariate polynomial approximation can be suitably compressed. 2000 AMS subject classification: 41A10, 65D32.
منابع مشابه
The Proof of Tchakaloff’s Theorem
We provide a simple proof of Tchakaloff’s Theorem on the existence of cubature formulas of degree m for Borel measures with moments up to order m. The result improves known results for non-compact support, since we do not need conditions on (m + 1)st moments. We consider the question of existence of cubature formulas of degree m for Borel measures μ, where moments up to order m exist: Definitio...
متن کاملAdaptive Compressed Image Sensing Using Dictionaries
In recent years, the theory of Compressed Sensing has emerged as an alternative for the Shannon sampling theorem, suggesting that compressible signals can be reconstructed from far fewer samples than required by the Shannon sampling theorem. In fact the theory advocates that non-adaptive, ‘random’ functionals are in some sense optimal for this task. However, in practice, Compressed Sensing is v...
متن کاملReconstructing undersampled MR Images by utilizing principal-component-analysis-based pattern recognition
Compressed sensing technique is a recent framework for signal sampling and recovery. It allows signal acquisition with less sampling than required by Nyquist-Shannon theorem and reduces data acquisition time in MRI. When the sampling rate is low, prior knowledge is essential to reconstruct the missing features. In this paper, a different reconstruction method is proposed by using the principal ...
متن کاملA Compressed Sensing Signal Processing Research
In the classical Shannon/Nyquist sampling theorem, information is not lost in uniformly sampling a signal, signal must be sampled at least two times faster than its bandwidth. Because of the restriction of the Nyquist rate, it end up with too many samples in many applications, and it becomes a great challenge for further transmission and storage. In recent years, an emerging theory of signal ac...
متن کاملRandom Sampling and Signal Bregman Reconstruction Based on Compressed Sensing
Compressed sensing (CS) sampling is a sampling method which is based on the signal sparse. Much information can be extracted from as little as possible of the data by applying CS, and this method is the idea of great theoretical and applied prospects. In the framework of compressed sensing theory, the sampling rate is no longer decided in the bandwidth of the signal, but it depends on the struc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015